Polygon graphs of Girth 6
نویسندگان
چکیده
A graph G is a triple, consisting of a vertex set V= V(G), an edge set E=E(G) and a map that associates to each edge two vertices (not necessarily distinct) called its end points. A loop is an edge whose end points are equal. Multiple edges are edges having same end points. A simple graph is one having no loops or multiple edges. To any graph, we can associate the adjacency matrix A which is an n×n matrix (n=IvI) with rows and columns indexed by the elements of vertex set and the (x,y)-th entry is the number of edges connecting x and y. A path is a non-empty graph
منابع مشابه
On Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملLarge Monotone Paths in Graphs with Bounded Degree
We prove that for every > 0 and positive integer r, there exists ∆0 = ∆0( ) such that if ∆ > ∆0 and n > n(∆, , r) then there exists a packing of Kn with b(n − 1)/∆c graphs, each having maximum degree at most ∆ and girth at least r, where at most n edges are unpacked. This result is used to prove the following: Let f be an assignment of real numbers to the edges of a graph G. Let α(G, f) denote ...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملSymmetric Cubic Graphs of Girth at Most 7
By a symmetric graph we mean a graph X which automorphism group acts transitively on the arcs of X. A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Tutte [31, 32] showed that every finite symmetric cubic graph is s-regular for some s ≤ 5. It is well-known that there are precisely five symmetric cubic graphs of girth less than 6. All these graphs can be re...
متن کاملGirth 5 Graphs from Elliptic Semiplanes
For 3 ≤ k ≤ 20 with k 6= 4, 8, 12, all the smallest currently known k–regular graphs of girth 5 have the same orders as the girth 5 graphs obtained by the following construction: take a (not necessarily Desarguesian) elliptic semiplane S of order n− 1 where n = k − r for some r ≥ 1; the Levi graph Γ (S) of S is an n–regular graph of girth 6; parallel classes of S induce co–cliques in Γ (S), som...
متن کامل